A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
نویسندگان
چکیده
منابع مشابه
Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a bounded geometric domain such that the generating points of the tessellations are also the centroids (mass centers) of the corresponding Voronoi regions with respect to a given density function. Centroidal Voronoi tessellations may also be defined in more abstract and more general settings. Due to the natural optimization pr...
متن کاملPlane-Sweep Incremental Algorithm: Computing Delaunay Tessellations of Large Datasets
We present the plane-sweep incremental algorithm, a hybrid approach for computing Delaunay tessellations of large point sets whose size exceeds the computer’s main memory. This approach unites the simplicity of the incremental algorithms with the comparatively low memory requirements of plane-sweep approaches. The procedure is to first sort the point set along the first principal component and ...
متن کاملAcceleration schemes for computing centroidal Voronoi tessellations
Centroidal Voronoi tessellations (CVT) have diverse applications in many areas of science and engineering. The development of e cient algorithms for their construction is a key to their success in practice. In this paper, we study some new algorithms for the numerical computation of the CVT, including the Lloyd–Newton iteration and the optimization based multilevel method. Both theoretical anal...
متن کاملFast Methods for Computing Centroidal Voronoi Tessellations
ACentroidalVoronoi tessellation (CVT) is aVoronoi tessellation inwhich the generators are the centroids for each Voronoi region. CVTs have many applications to computer graphics, image processing, data compression, mesh generation, and optimal quantization. Lloyd’s method, the most widely method used to generate CVTs, converges very slowly for larger scale problems. Recently quasi-Newton method...
متن کاملAn Algorithm for Predicting Recurrence of Breast Cancer Using Genetic Algorithm and Nearest Neighbor Algorithm
Introduction: Breast cancer is one of the most common types of cancer and the most common type of malignancy in women, which has been growing in recent years. Patients with this disease have a chance of recurrence. Many factors reduce or increase this probability. Data mining is one of the methods used to detect or anticipate cancers, and one of its most common uses is to predict the recurrence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2007
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2007.03.027